A Bandwidth Latency Tradeo for Broadcastand Reduction ?
نویسنده
چکیده
The \fractional tree" algorithm for broadcasting and reduction is introduced. Its communication pattern interpolates between two well known patterns | sequential pipeline and pipelined binary tree. The speedup over the best of these simple methods can approach two for large systems and messages of intermediate size. For networks which are not very densely connected the new algorithm seems to be the best known method for the important case that each processor has only a single (possibly bidirectional) channel into the communication network.
منابع مشابه
Scheduling of Multicast Tra c in Tunable-Receiver WDM Networks with Non-Negligible Tuning Latencies
We consider the problem of supporting multipoint communication at the media access control (MAC) layer of broadcastand-select WDM networks. We rst show that bandwidth consumption and channel utilization arise as two con icting objectives in the design of scheduling algorithms for multicast tra c in this environment. We then present a new technique for the transmission of multicast packets, base...
متن کاملEnergy/Latency/Image Quality Tradeo s in Enabling Mobile Multimedia Communication
Future wireless applications, such as cellular video telephony, wireless LANs and PANs, home networks, and sensor networks, point towards a growing demand for multimedia content in wireless communication. However, mobile multimedia communication has several bottlenecks including bandwidth requirements, lowpower constraints, and channel noise. In this paper, we propose a method to overcome the e...
متن کاملVariable Latency Turbo Codes for Wireless Multimedia Applications
| Multimedia communication systems require di erent Qualities of Service (QoS) for di erent types of information. The QoS is generally expressed in terms of a maximum acceptable latency and Bit Error Rate (BER) or Frame Error Rate (FER). In turbo coded systems a tradeo between latency and BER results from the choice of interleaver size. This tradeo can be exploited in multimedia communication s...
متن کاملIssues in the design of store buffers in dynamically scheduled processors
Processor performance can be sensitive to load-store ordering, memory bandwidth, and memory access latency. A store bu er is a mechanism that exists in many current processors to accomplish one or more of the following: store access ordering, latency hiding, and data forwarding. Di erent policies that govern store bu er behavior can a ect overall processor performance. However, the performance ...
متن کاملMemory Bandwidth Bottleneck and Its Amelioration by a Compiler
As the speed gap between CPU and memory widens, memory hierarchy has become the primary factor limiting program performance. Until now, the principal focus of hardware and software innovations has been overcoming latency. However, the advent of latency tolerance techniques such as non-blocking cache and software prefetching begins the process of trading bandwidth for latency by overlapping and ...
متن کامل